|
''For the Hindu deity refer to Kannan'' Ravindran Kannan ((タミル語:ரவிந்திரன் கண்ணன்); born 12 March 1953, Madras)〔''Who's Who in Frontiers in Science and Technology 1985''〕 is a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science. Before joining Microsoft, he was the William K. Lanman Jr. Professor of Computer Science and Professor of Applied Mathematics at Yale University. He has also taught at MIT and CMU. The ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) presented its 2011 Knuth Prize to Ravi Kannan for developing influential algorithmic techniques aimed at solving long-standing computational problems.〔(Microsoft Researcher to Receive ACM SIGACT Knuth Prize )〕 Ravi Kannan did his B.Tech at IIT, Bombay and PhD. at Cornell University. His research interests include Algorithms, Theoretical Computer Science and Discrete Mathematics as well as Optimization. His work has mainly focused on efficient algorithms for problems of a mathematical (often geometric) flavor that arise in Computer Science. He has worked on algorithms for integer programming and the geometry of numbers, random walks in ''n''-space, randomized algorithms for linear algebra and learning algorithms for convex sets. ==Key contributions== Among his many contributions, two are # Polynomial-time algorithm for approximating the volume of convex bodies # Algorithmic version for Szemerédi regularity partition 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Ravindran Kannan」の詳細全文を読む スポンサード リンク
|